Optimal parallel hypercube algorithms for polygon problems
نویسندگان
چکیده
منابع مشابه
Optimal Parallel Hypercube Algorithms for Polygon Problems
We present parallel techniques on hypercubes for solving optimally a class of polygon problems. We thus obtain optimal O(logn)-lime, n-processor hypercube algorithms for the problems of computing the portions of an n-vertex simple polygonal chain C that are visible from a given source point, computing the convex hull of C, testing an n-verlex simple polygon P for monotonicity, and other related...
متن کاملParallel Algorithms for Hypercube Allocation
Parallel algorithms of the hypercube allocation strategies are considered in this paper. Although the sequential algorithms of various hypercube allocation strategies are easier to implement, their worst case time complexities exponentially increase as the dimension of the hypercube increases. We show that the free processors can be utilized t o perform the allocation jobs in parallel to improv...
متن کاملOptimal Parallel Algorithms for Computer Vision Problems
The computational model on which the algorithms are developed is the arrays with reconfigurable optical buses (abbreviated to AROB). It integrates the advantages of both optical transmission and electronic computation. In this paper, instead of using the radix-2 system, a radix-x system can be used to represent the numbers of the intermediate results of algorithms. We first design two Oð1Þ time...
متن کاملParallel Genetic Algorithms for Hypercube Machines
In this paper we investigate the design of highly parallel Genetic Algorithms. The Traveling Salesman Problem is used as a case study to evaluate and compare diierent implementations. To x the various parameters of Genetic Algorithms to the case study considered, the Holland sequential Genetic Algorithm, which adopts diierent population replacement methods and crossover operators, has been impl...
متن کاملOptimal Hypercube Algorithms for Labeled Images
-Optimal hypercube algorithms are given for determining properties of labeled figures in a digitized black/white image stored one pixel per processor on a fine-grained hypercube. A figure (i.e., connected component) is a maximally connected set of black pixels in an image. The figures of an image are said to be labeled if every black pixel in the image has a label, with two black pixels having ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computers
سال: 1995
ISSN: 0018-9340
DOI: 10.1109/12.392849